Monotonic Aggregation in Deductive Databases
نویسندگان
چکیده
منابع مشابه
Non-Monotonic Negation in Probabilistic Deductive Databases
In this paper we study tlw uses and the se mantics of non-monotonic negation in prob abilistic deductive databases. Based on the stahl<semantics for classical logic program ming, we in I roduce the notion of stable for mula functions. We show that. stable for mula functions are minimal fixpoints of op erators associated with probabilistic dednc1 ive databases with negation. Furthermore, s...
متن کاملAggregation in Disjunctive Deductive Databases
Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...
متن کاملFoundations of Aggregation in Deductive Databases
As a foundation for providing semantics for aggregation within recursion, the structure of subsets of partially ordered domains is studied. We argue that the underlying cause of many of the di culties encountered in extending deductive database semantics to include aggregation is that set construction does not preserve the structure of the underlying domain very well. We study a binary relation...
متن کاملAggregation and Relevance in Deductive Databases
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and \largest k values." Our approach is based on an extended notion of relevance of facts to queries that takes aggregate operations into account. The approach has two parts: a rewriting part that labels predicates with \aggregate selections," and an evaluation part th...
متن کاملKey Constraints and Monotonic Aggregates in Deductive Databases
We extend the fixpoint and model-theoretic semantics of logic programs to include unique key constraints in derived relations. This extension increases the expressive power of Datalog programs, while preserving their declarative semantics and efficient implementation. The greater expressive power yields a simple characterization for the notion of set aggregates, including the identification of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1453